Sequential Aggregation of Verifiable Information

Scalably-Verifiable Sequential Synthesis

This report is a case-study of the synergy between sequential synthesis and verification. Described is an efficient implementation of a sequential synthesis that uses simple induction to detect and merge sequentially-equivalent registers and nodes in a sequential circuit with a given initial state. Since retiming is not performed, state-encoding, scan chains, and test vectors are essentially pr...

Proof Sketches: Verifiable Multi-Party Aggregation

Recent work on distributed aggregation has assumed a benign population of participants. In modern distributed systems, it is now necessary to account for adversarial behavior. In this paper we consider the problem of ensuring verifiable yet efficient results to typical aggregation queries in a distributed, multi-party setting. We describe a general framework for the problem, including the threa...

Sequential Aggregation of Judgments

Embedding Verifiable Information Flow Analysis1

Pervasive computing is the next generation of computing environments. As a result more and more applications are dynamically deployed on a growing set of small safe devices. Applications delivered by different vendors may share code and data while they may not trust one another. We present an information flow analysis for full Java bytecode adapted for applications dedicated to embedded systems...

Information-theoretically Secure Strong Verifiable Secret Sharing

In a (t,n) secret sharing scheme, a mutually trusted dealer divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. When there is no mutually trusted dealer, a (n,t,n) secret sharing scheme can be used to set up a (t,n) secret sharing because each shareholder also acts as a dealer to decide ...